Refinement types for TypeScript
نویسندگان
چکیده
منابع مشابه
Refinement Types for TypeScript
1.1 Object Constraint System Our system leverages the idea introduced in the formall core of X10 [3] to extend a base constraint system C with a larger constraint system O (C), built on top of C. The original system C comprises formulas taken from a decidable SMT logic [2], including, for example, linear arithmetic constraints and uninterpreted predicates. The Object Constraint System O (C) int...
متن کاملConcrete Types for TypeScript
TypeScript extends JavaScript with optional type annotations that are, by design, unsound and, that the TypeScript compiler discards as it emits code. This design point preserves programming idioms developers are familiar with, and allows them to leave their legacy code unchanged, while offering a measure of static error checking in parts of the program that have type annotations. We present an...
متن کاملRefinement Types for Ruby
Refinement types are a popular way to specify and reason about key program properties. In this paper, we introduce RTR, a new system that adds refinement types to Ruby. RTR is built on top of RDL, a Ruby type checker that provides basic type information for the verification process. RTR works by encoding its verification problems into Rosette, a solver-aided host language. RTR handles mixins th...
متن کاملRefinement Types for tla +
TLA is a specification language, mainly intended for concurrent and distributed systems. Its non-temporal fragment is based on a variant of (untyped) ZF set theory. Motivated by the integration of the TLA Proof System with SMT solvers or similar tools based on multi-sorted first-order logic, we define a type system for TLA and we prove its soundness. The system includes refinement types, which ...
متن کاملRefinement types for specification
We develop a theory of program specification using the notion of refinement type. This provides a notion of structured specification, useful for verification and program development. We axiomatise the satisfaction of specifications by programs as a generalised typing relation and give rules for refining specifications. A per semantics based on Henkin models is given, for which the system is pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2016
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2980983.2908110